Space Complexity of LogicGuard Revisited
نویسنده
چکیده
We analyse the space complexity of specific formula structures constructed using the core language of the LogicGuard framework. Unlike previous analysis which focused on the local space complex around a single quantifier, in this work we fix the global structure of the formula enough to allow analysis as a whole. Though we end up with precise results for two very specific cases, we show that these cases are upper and lower bounds of arbitrary formulae with similar structure. We ignore cases which need infinite space as previous work deals with them sufficiently.
منابع مشابه
Space Complexity of Operational Semantics for the LogicGuard Core Language
In this work we provide a space complexity analysis of the core language of the LogicGuard framework. Our approach is to abstract away from the formula structure of the core language in order to construct invariants for a recursive function. This final recursive function provided an upper bound for the number of instances of the monitor that need to be kept in memory over any duration of time. ...
متن کاملPredicting Space Requirements for a Stream Monitor Specification Language
The LogicGuard specification language for the runtime monitoring of message/event streams specifies monitors by predicate logic formulas of a certain kind. In this paper we present an algorithm that gives upper bounds for the space requirements of monitors specified in a formally elaborated core of this language. This algorithm has been implemented in the LogicGuard software and experiments hav...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملBenchmarks and Performance Analysis of the LogicGuard Framework
This paper presents benchmarks, performance measurements and analysis for LogicGuard framework. The specification and data used to perform the benchmarks are all artificial and were designed to show various complexity levels. For this purpose, a set of parameters was defined to generate specifications and sample data, which include quantifier depth, search direction, windows size and delay. A s...
متن کاملEPiC Series in Computing
We analyze the space complexity of monitoring streams of messages whose expected behavior is specified in a fragment of predicate logic; this fragment is the core of the LogicGuard specification language that has been developed in an industrial context for the runtime monitoring of network traffic. The execution of the monitors is defined by an operational semantics for the step-wise evaluation...
متن کامل